Opt Art

نویسنده

  • Robert Bosch
چکیده

Optimization is the branch of mathematics concerned with finding the best way to complete a task. Certainly, some tasks are easy, and we need not rely on optimization to tackle them. But many others are much more difficult, so much so that we may have very little hope of completing them satisfactorily—let alone optimally—without optimization. For example, suppose a friend of ours does volunteer work for a Meals-onWheels program. Once a week she bikes to the Meals-on-Wheels headquarters and picks up 20 meals and a list of 20 names and addresses. She then gets in the Meals-on-Wheels van, delivers the meals, and returns to headquarters. Her goal is to drop off the meals in an order that will minimize the number of miles she’ll travel, as this will minimize fuel consumption, pollutant emissions, and the amount of time she’ll spend on the job. Is her task—planning the route she’ll take—an easy one? It depends. If all of the addresses are on the same road, then it is extremely easy; the optimal route will be obvious to anyone who takes a look at a map. But if not, it can be extremely difficult, especially in the case in which the addresses appear to have been scattered about the city at random. (Why? Why not just list and evaluate every single route? The answer is that there are 20! ≈ 2.43 × 10 routes, one for every permutation of the 20 addresses. Even if our friend has a laptop that can evaluate one trillion (10) routes per second, she’ll have to run it for about 28 days if she wants to find the optimal route via complete enumeration!) Incidentally, this task is an instance of the Traveling Salesman Problem (TSP), one of the most difficult, important, and well-studied problems in the optimization field. Optimization has a seemingly unlimited number of applications. It has been put to good use in a great number of diverse disciplines: advertising, agriculture, biology, business, economics, engineering, manufacturing, medicine, telecommunications, and transportation (to name but a few). In this article, we showcase its amazing utility by describing some applications in the area of art, which at first glance would seem to have no use for it whatsoever!

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Foundations of Fixed Parameter Inapproximability

Given an instance I of a minimization problem with optimum opt, fixed parameter ρ(k) inapproximability is to find a k ≥ opt and prove that it is not possible to compute a solution of value ρ(k) · k. In this paper all proofs are under the eth, and we are interested only in k being the optimum value of some instance. Our question is: What properties make a good Fixed Parameter Inapproximability p...

متن کامل

The Foundation of Fixed Parameter Inapproximability

Given an instance I of a minimization problem with optimum opt, fixed parameter ρ(k) inapproximability is to find a k ≥ opt and prove that it is not possible to compute a solution of value ρ(k) · k usually under the eth. In this paper we are interested only in k being the optimum value of some instance. Our question is: What properties make a good Fixed Parameter Inapproximability proof? We cla...

متن کامل

The Foundation of Fixed Parameter Inapproximability

Given an instance I of a minimization problem with optimum opt, fixed parameter ρ(k) inapproximability is to find a k ≥ opt and prove that it is not possible to compute a solution of value ρ(k) · k. In this paper all proofs are under the eth. In this paper all ratios are larger than 1. An (r, t)-FPT-hardness (in opt) for two functions r, t, is showing that the problem admits no r(opt) approxima...

متن کامل

Barriers to initiation of antiretroviral treatment in rural and urban areas of Zambia: a cross-sectional study of cost, stigma, and perceptions about ART

BACKGROUND While the number of HIV-positive patients on antiretroviral therapy (ART) in resource-limited settings has increased dramatically, some patients eligible for treatment do not initiate ART even when it is available to them. Understanding why patients opt out of care, or are unable to opt in, is important to achieving the goal of universal access. METHODS We conducted a cross-section...

متن کامل

Understanding the Limits of Capacity Sharing in CMP Private Caches

Chip Multi Processor (CMP) systems present interesting design challenges at the lower levels of the cache hierarchy. Private L2 caches allow easier processor-cache design reuse, thus scaling better than a system with a shared L2 cache, while offering better performance isolation and lower access latency. While some private cache management schemes that utilize space in peer private L2 caches ha...

متن کامل

An Approximation Algorithm for the Art Gallery Problem

Given a simple polygon P on n vertices, two points x, y in P are said to be visible to each other if the line segment between x and y is contained in P. The point-guard art gallery problem asks for a minimum set S such that every point in P is visible from a point in S. Assuming integer coordinates and a special general position assumption, we present the first O(log OPT)-approximation algorith...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006